Enhanced Biclustering for Gene Expression Data

نویسنده

  • R. Parimala
چکیده

Microarray technology is a powerful method for monitoring the expression level of thousands of genes in parallel. Using this technology, the expression levels of genes are measured. Microarray data is represented in N × M matrix. Each row indicates genes and each column indicates condition. In Gene Expression data, standard clustering algorithms are called as global clustering. In global clustering, genes are analyzed under all experimental conditions based on their expression. Biclustering is a very popular method to identify hidden coregulation patterns among genes and to identify the local structures of genes and conditions. In existing system, Cheng and Church biclustering algorithm is presented as an alternative approach to standard clustering techniques to identify local structures and also identify subsets of genes that shows similar expression patterns across specific subsets of experimental conditions and vice versa. Clustering the microarray data is based on user defined threshold value, this affects the quality of biclusters formed. In proposed scheme, threshold value ∂ is calculated rather than user defined threshold. Biclusters are formed based on the low mean squared residues and ∂, which would improve the quality of the biclusters.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Biclustering Analysis of Coregulated Biclusters from Gene Expression Data

In this paper, the Biclustering analysis of coregulated biclusters from gene expression data is carried out. Gene expression is the process, which produces functional product from the gene information. Data mining is used to find relevant and useful information from databases. Clustering groups the genes according to the given conditions. Biclustering algorithms belong to a distinct class of cl...

متن کامل

به کارگیری خوشه‌بندی دوبعدی با روش «زیرماتریس‌های با میانگین- درایه‌های بزرگ» در داده‌های بیان ژنی حاصل از ریزآرایه‌های DNA

Background and Objective: In recent years, DNA microarray technology has become a central tool in genomic research. Using this technology, which made it possible to simultaneously analyze expression levels for thousands of genes under different conditions, massive amounts of information will be obtained. While traditional clustering methods, such as hierarchical and K-means clustering have been...

متن کامل

Comparison of Biological Significance of Biclusters of SIMBIC and SIMBIC+ Biclustering Models

Query driven Biclustering Model refers to the problem of extracting biclusters based on a query gene or query condition. The extracted biclusters consist of a set of genes and a subset of conditions that are similar to the query gene or query condition and it includes the query input also. Two approaches applied for biclustering problems are topdown and bottom-up, based on how they tackle the p...

متن کامل

An Improved Biclustering Algorithm for Gene Expression Data

Cheng-Church (CC) biclustering algorithm is the popular algorithm for the gene expression data mining at present. Only find one biclustering can be found at one time and the biclustering that overlap each other can hardly be found when using this algorithm. This article puts forward a modified algorithm for the gene expression data mining that uses the middle biclustering result to conduct the ...

متن کامل

Gene co-expression networks via biclustering Differential gene co-expression networks via Bayesian biclustering models

Identifying latent structure in large data matrices is essential for exploring biological processes. Here, we consider recovering gene co-expression networks from gene expression data, where each network encodes relationships between genes that are locally co-regulated by shared biological mechanisms. To do this, we develop a Bayesian statistical model for biclustering to infer subsets of co-re...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013